Optimizing Product Line Designs: Efficient Methods and Comparisons
نویسندگان
چکیده
W take advantage of recent advances in optimization methods and computer hardware to identify globally optimal solutions of product line design problems that are too large for complete enumeration. We then use this guarantee of global optimality to benchmark the performance of more practical heuristic methods. We use two sources of data: (1) a conjoint study previously conducted for a real product line design problem, and (2) simulated problems of various sizes. For both data sources, several of the heuristic methods consistently find optimal or near-optimal solutions, including simulated annealing, divide-and-conquer, product-swapping, and genetic algorithms.
منابع مشابه
OPERATIONS RESEARCH CENTER Working Paper MASSACHUSETTS INSTITUTE OF TECHNOLOGY by Optimizing Product Line Designs : Efficient Methods and Comparisons OR 373 - 05
متن کامل
MASSACHUSETTS INSTITUTE OF TECHNOLOGY by Optimizing Product Line Designs : Efficient Methods and Comparisons OR 373 - 05
Toubia for the data used in the study. We compare a broad range of optimal product line design methods. The comparisons take advantage of recent advances that make it possible to identify the optimal solution to problems that are too large for complete enumeration. Several of the methods perform surprisingly well, including Simulated Annealing, Product-Swapping and Genetic Algorithms. The Produ...
متن کاملکاربرد روشهای هیورستیک اولویت وزنی و طولانی ترین زمان عملیات (LCR) متعادل سازی خطوط مونتاژ و تاثیر آن بر عملکرد سازمان
According to researches, one of the productivity barriers among many organizations is assembly line balancing problem, which needs scientific models to be solved. This paper examines the effect of line balancing on the functioning of assembly line in two sections. In the first section, after studying the theoretic bases and reviewing the literature, we have discussed the assembly concepts, diff...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Management Science
دوره 54 شماره
صفحات -
تاریخ انتشار 2008